Distance Two labeling for Multi-Storey Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance Two Labeling of Some Total Graphs

An L(2, 1)-labeling (or distance two labeling) of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that |f(x) − f(y)| ≥ 2 if d(x, y) = 1 and |f(x) − f(y)| ≥ 1 if d(x, y) = 2. The L(2, 1)-labeling number λ(G) of G is the smallest number k such that G has an L(2, 1)-labeling with max{f(v) : v ∈ V (G)} = k. In this paper we completely determine the λ-...

متن کامل

Labeling graphs with two distance constraints

Given a graph G and integers p, q, d1 and d2, with p > q, d2 > d1 > 1, an L(d1, d2; p, q)-labeling of G is a function f : V (G) → {0, 1, 2, . . . , n} such that | f (u) − f (v)| > p if dG(u, v) 6 d1 and | f (u) − f (v)| > q if dG(u, v) 6 d2. A k-L(d1, d2; p, q)-labeling is an L(d1, d2; p, q)-labeling f such that maxv∈V (G) f (v) 6 k. The L(d1, d2; p, q)-labeling number of G, denoted by λ d1,d2(...

متن کامل

Distance Labeling for Permutation Graphs

We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...

متن کامل

Distance Two Labeling of the Composition of Graphs

An L(j, k) labeling of a graph G is a vertex labeling such that for any pair of positive integers j and k the difference of the labels of each adjacent vertices is at least j and that of each vertices of distance 2 is at least k. The minimum of the spans of all L(j, k)-labelings for G is the L(j, k)-number of G and denoted it by λjk(G). In this paper, we show that L(1, 1)-number λ1(Pn[G]) for t...

متن کامل

Labeling planar graphs with a condition at distance two

Department of Mathematical Analysis, Faculty of Mathematics and Physics, Charles University, Sokolovská 83, 186 75 Prague, Czech Republic. E-mail: [email protected]. Department of AppliedMathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstı́ 25, 118 00 Prague, Czech Republic. E-mail: [email protected]. Institute for Mathematics, Technical University B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks

سال: 2010

ISSN: 0975-7260

DOI: 10.5121/jgraphoc.2010.2303